knapsack algorithm
英 [ˈnæpsæk ˈælɡərɪðəm]
美 [ˈnæpsæk ˈælɡərɪðəm]
网络 背包算法
双语例句
- Solving Knapsack Problem with Improved Pseudo-parallel Genetic Algorithm
基于改进型伪并行遗传算法的背包问题求解 - Solution of 0-1 Knapsack Problem Applying Improved CSA Algorithm
改进的克隆选择算法求解0-1背包问题 - In this paper, a modified particle swarm optimization algorithm is presented to solve knapsack problem, and the detailed realization of the algorithm is illustrated.
本文提出了改进的粒子群算法求解背包问题，阐明了该算法求解背包问题的具体实现过程。 - Research of Grid Scheduling for Multidimensional 0-1 Knapsack and Genetic Algorithm
多维0/1背包与遗传算法的网格调度研究 - In this paper, we analyzed some property for the single restrict 0-1 ILP ( one dimension knapsack problem, knapsack problem), designed an algorithm using the linear programming solution combined with heuristic& reduce dimension and replace variable algorithm.
对问题单约束0-1线性整数规划问题（0-1ILP，背包问题）的特性进行了分析，设计了问题求解的算法&降维替换算法（线性规划求解与特殊启发式相结合的方法）。 - The article established the optimization model for the load restoration, a zero-one knapsack problem with many safe constraints, and designed a modified hybrid genetic algorithm which combine the greedy algorithm and modify genetic algorithm together to resolve it.
文章把电力系统的负荷恢复问题建模为带众多约束条件的0-1背包问题，并设计了一种将贪心算法与改进遗传算法结合起来的改进混合遗传算法来对此问题进行求解。 - The algorithm integrated with widespread of computer network has been applied to the distributed cutting stock system Adopting Heuristic search and Knapsack algorithm, the algorithm makes each layout optimal locally and obtained the approximate optimal solution.
并结合计算机网络的大量应用，将算法应用于分布式排样系统。算法的主要思想是采用启发式搜索和背包算法，使每次排样都达到局部最优，从而得到近似最优解。 - Take 0-1 knapsack problem for example, in contrast to static state space tree algorithm, the new algorithm spends less times and it helps to extend the application of backtracking algorithm.
以0-1背包问题为例，说明动态树方法对求解线性规划问题等是非常有用的，且该算法所用时间少于静态状态空间树方法，有助于扩大回溯算法的应用。 - Knapsack public key algorithm for Chinese characters encryption
基于汉字的背包公钥加密算法 - Multi-objective 0-1 knapsack problem is an NP-complete multi-objective optimization problem. Population-based genetic algorithm is well-suited for multi-objective optimization problems.
多目标0-1背包问题是一个NP-complete的多目标优化问题，基于群体搜索机制的遗传算法非常适合多目标优化问题的求解。 - Solution to 0/ 1 knapsack problem based on improved ant colony algorithm
基于改进型蚁群算法求解0／1背包问题 - A new algorithm which produce private key is given by improving "trap knapsack" algorithm and its time complexity and degrees of security are analysed.
该算法在经典陷门渐缩算法的基础上进行了改进，提出了一种产生私有密钥的新方法。并对算法的复杂度和保密强度进行了分析。 - Study on the application of integer knapsack problem and its algorithm
整数背包问题的应用及其算法研究 - The empirical results on the multi-objective knapsack problem show that above algorithm is able to converge on the better Pareto front quickly and has a strong robustness.
求解多目标背包问题的仿真结果表明，所提算法可以快速收敛到较好的Pareto前沿，有很强的鲁棒性。 - Since Shamir designed an algorithm attacking successfully the Ralph Merkle and Martin Hellman's knapsack cryptosystem, the algorithm of the knapsack cryptosystem has been improved such that it can not be attacked by Shamir's attacking.
自从Shamir提出攻击RalphMerkle和MartinHellman背包密码系统的算法以来，背包密码系统在算法设计上进行了改进，使其在改进后能抵挡Shamir攻击。 - Distributed Cutting Stock System Based on Heuristic Search and Knapsack Algorithm
基于启发式搜索和背包算法的分布式排样系统 - Being different from the traditional Knapsack algorithm, KFA is for multiple-objective optimization.
与传统的背包算法不同的是，该算法适合于多维目标优化。 - Knapsack Algorithm for Layout Optimization of Rectangular Pieces on Stock
矩形件排样优化的背包算法 - A value density is designed for 0-1 knapsack problem and on this basis, a bybrid genetic algorithm is proposed for solving 0-1 knapsack problem.
对于0-1背包问题设计一种价值密度，并在此基础上提出求解0-1背包问题的混合遗传算法。 - Solving the 0-1's knapsack Problem by Genetic Algorithm
用基本遗传算法解决0-1背包问题 - Finally the optimal solution of the model is transformed into the solution of quadratic knapsack problem by the rounding algorithm.
应用罚函数法求得该模型的最优解，再利用扰动算法将该最优解转化成二次背包问题的解。 - The proposed algorithm for knapsack problem is based on MIMD. The sort algorithm by sampling is introduced in the sorting stage.
并行背包算法基于MIMD结构，在排序过程中引入基于采样的排序算法，然后对子集和生成和搜索过程加以优化。 - In analysis of the object memory allocation issues, paper declares it as the classic 0/ 1 knapsack, points out particularity and then puts forward the improved greedy algorithm.
分析对象的存储器分配问题时，首先将该问题表述为经典的0/1背包问题，接着指出该问题的特殊性，提出改进后的贪心算法。 - Selection for multi-dimensional knapsack quantum evolutionary algorithm can be divided into two stages, first using a greedy algorithm to construct a initial solution.
针对多选择多维背包的量子进化算法可以分为两个阶段，首先使用一个贪心算法构造一个初始解。 - Based on the research of many scholars, we have analysed the adaptive genetic algorithms that had been proposed, and have proposed two new adaptive genetic algorithms, which are used to solve the 0-1 knapsack problem.1.The mutation only genetic algorithm ( MOGA) have been proposed.
本文在众多学者研究的基础上，对已有自适应遗传算法进行深入剖析，进而提出两个新的自适应遗传算法，并且用于解决0-1背包问题。 - It combines the parallelism of resource selection in Knapsack Problem and the inherent parallelism in genetic algorithm, which improves greatly the searching efficiency and the quality of solution.
该算法可以将背包问题中资源选择的并行性和遗传算法固有的并行性相结合，极大的提高了搜索效率和解的质量。 - And then we solve different scales of knapsack problem with the new algorithm.
然后利用本文构造的算法分别针对不同规模的背包问题进行了求解。 - For large-scale knapsack problems, the usual method is the heuristic algorithm, and genetic algorithm is used as a common heuristic one.
对于大规模的背包问题，通常的求解方法为启发式算法，遗传算法是启发式算法中常用的一种，由于背包问题的特点，及借鉴以往研究者的经验，故本文选用的算法也为遗传算法。 - Second, a modified knapsack algorithm is used to find the appropriate allocation between VMs and hosts.
其次，根据预测结果，利用修改后的背包算法在主机之间合理地分配虚拟机。 - According to the bandwidth and the total reception rate, we define the problem of SFN multicast/ broadcast services selection as a KNAPSACK problem and present a greedy algorithm to solve it.
然后，依据带宽和接收率进行建模，将单频网多播广播业务的选择看作一个背包问题，用贪婪算法给予解决。